Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
نویسندگان
چکیده
منابع مشابه
Mathematical Models and a Constructive Heuristic for finding Minimum Fundamental Cycle Bases
The problem of finding a fundamental cycle basis with minimum total cost in a graph arises in many application fields. In this paper we present some integer linear programming formulations and we compare their performances, in terms of: instance size, CPU time required for the solution, and quality of the associated lower bound derived by solving the corresponding continuous relaxations. Since ...
متن کاملOn finding cycle bases and fundamental cycle bases with a shortest maximal cycle
An undirected biconnected graph G with nonnegative integer lengths on the edges is given. The problem we consider is that of finding a cycle basis B of G such that the length of the longest cycle included in B is the smallest among all cycle bases of G. We first observe that Horton’s algorithm [SIAM J. Comput. 16 (2) (1987) 358–366] provides a fast solution of the problem that extends the one g...
متن کاملA note on fundamental, non-fundamental, and robust cycle bases
In many biological systems, robustness is achieved by redundant wiring, and reflected by the presence of cycles in the graphs connecting the systems’ components. When analyzing such graphs, cyclically robust cycle bases of are of interest since they can be used to generate all cycles of a given 2-connected graph by iteratively adding basis cycles. It is known that strictly fundamental (or Kirch...
متن کاملBenchmarks for Strictly Fundamental Cycle Bases
In the MINIMUM STRICTLY FUNDAMENTAL CYCLE BASIS (MSFCB) problem one is looking for a spanning tree such that the sum of the lengths of its induced fundamental circuits is minimum. We identify square planar grid graphs as being very challenging testbeds for the MSFCB. The best lower and upper bounds for this problem are due to Alon, Karp, Peleg, and West (1995) and to Amaldi et al. (2004). We im...
متن کاملA note on finding minimum mean cycle
In a directed graph with edge weights, the mean weight of a directed cycle is the weight of its edges divided by their number. The minimum cycle mean of the graph is the minimum mean weight of a cycle. Karp gave a characterization of minimum cycle mean and an O(nm) algorithm to compute it, where n is the number of vertices and m is the number of edges. However, an algorithm he suggested for ide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2005
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0501015l